Local Search Topology: Implications for Planner Performance

نویسندگان

  • Mark Roberts
  • Adele Howe
چکیده

Hoffmann’s topological analysis of the h and h F state spaces explained why Fast Forward dominated the performance on early planning domains (Hoffmann 2004). His taxonomy segmented domains according to the presence/size of local minima and dead-end class. Surprisingly, the taxonomy has not been used to explain the performance of other planners that use similar heuristics. In this paper, we extend this analysis in several ways: 1) We apply the taxonomy to 10 heuristic search (including FF-2.3) and 17 non-heuristic search planners to determine the extent to which it explains planner performance. 2) We test model scalability by examining a subset of challenging problems to determine the extent to which the topology explains performance. We conclude that topological analysis is a valuable tool in explaining the conditions under which h is favored. Similar analyses of newer domains and planners could benefit the community and may lead to more informed application, extensions, or simplifications of either the heuristics or the planners that use them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics and metaheuristics in forward-chaining planning

Forward-chaining heuristic search is a well-established and popular paradigm for planning. It is, however, characterised by two key weaknesses. First, search is guided by a domain-independent heuristic which although applicable in a wide range of domains, can often give poor guidance. Second, the metaheuristics used to control forward-chaining planning are often weak, using simple local-search ...

متن کامل

Adaptive Strategies for Probabilistic Roadmap Construction

This paper presents an experimental study of prospects for using adaptable local search techniques in probabilistic roadmap based motion planning. The classical PRM approach uses a single fast and simple local planner to build a network representation of the configuration space. Advanced PRM planners utilize heuristic sampling techniques and combine multiple local planners. The planner describe...

متن کامل

Monte-Carlo Exploration for Deterministic Planning

Search methods based on Monte-Carlo simulation have recently led to breakthrough performance improvements in difficult game-playing domains such as Go and General Game Playing. Monte-Carlo Random Walk (MRW) planning applies MonteCarlo ideas to deterministic classical planning. In the forward chaining planner ARVAND, MonteCarlo random walks are used to explore the local neighborhood of a search ...

متن کامل

An Empirical Analysis of Some Heuristic Features for Planning with Local Search in LPG

LPG is a planner that performed very well in the third and fourth International planning competitions. The system is based on a stochastic local search procedure, and it incorporates several heuristic features. In this paper we experimentally analyze the most important of them with the goal of understanding and evaluating their impact on the performance of the planner. In particular, we examine...

متن کامل

CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007